Kinematic Synthesis with Con guration Spaces

نویسنده

  • Devika Subramanian
چکیده

This paper introduces a new approach to the conceptual design of mechanical systems from qualitative speciications of behaviour. The power of the approach stems from the integration of techniques in qualitative physics and constraint programming. We illustrate the approach with an eeective kinematic synthesis method that reasons with qualitative representations of connguration spaces using constraint programming.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A robotic case study: optimal design for laparoscopic positioning stands

The positioning stand could help the surgeon to position and lock endoscopic tools without the need for an assistant surgeon. The kinematic con guration of the positioning stand is comprised of two main parts, the arm (for positioning) and the wrist (for orienting the tool). The main requirement of the wrist is to perform spherical movements around the incision point. A concentric multi-link sp...

متن کامل

Equivariant con guration spaces

We use the compression theorem (cf [7; section 6]) to prove results for equivariant con guration spaces analogous to the well-known non-equivariant results of May, Milgram and Segal [5,6,8]. AMS Classi cation 55P91, 55P35, 55P40; 57R91, 55P45, 55P47

متن کامل

Controllability of Kinematic Control Systems on

Many interesting and important control systems evolve on strati ed con guration spaces. Robotic systems, in particular, are of this nature. A legged robot has discontinuous equations of motion near points in the con guration space where each of its \feet" come into contact with the ground, and it is precisely the ability of the robot to lift its feet o of the ground that enables it to move abou...

متن کامل

Self Con guring Binary Multipliers for LUT addressable FPGAs

In this paper we present a self con gurable multiplication technique allowing vari able con guration time for a class of LUT based Field Programmable Gate Arrays FPGAs which exist today We show this technique to be implementable on FPGA architectures allowing internally addressable RAM primitives to be directly mapped to the Logic Elements LEs of the logic resource This provides run time read w...

متن کامل

Finding Product Line Configurations with High Performance by Random Sampling

ABSTRACT So‡ware Product Lines (SPLs) have many features for customization. Œis raises the challenge to €nd good performing con€gurations for an anticipated workload. As SPL con€guration spaces are huge, it is infeasible to benchmark all con€gurations to €nd an optimal one. Prior work focused on building performance models to predict and optimize SPL con€gurations; we randomly sample and recurs...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993